brute-force computation

См. также в других словарях:

• Brute force attack — In cryptanalysis, a brute force attack is a method of defeating a cryptographic scheme by trying a large number of possibilities; for example, possible keys in order to decrypt a message. In most schemes, the theoretical possibility of a brute… …   Wikipedia

• Brute-force attack — The EFF s US$250,000 DES cracking machine contained over 1,800 custom chips and could brute force a DES key in a matter of days. The photograph shows a DES Cracker circuit board fitted with 32 Deep Crack chips and some control chips. In… …   Wikipedia

• brute force — noun /bɹut ˈfɔɹs/ a) A method of accomplishing something primarily by means of strength, without the use of mechanical aids or, in combat, without strategic planning or tactics. E.g. to find the set of all positive integers that are multiples of… …   Wiktionary

• Mathematics of Sudoku — The class of Sudoku puzzles consists of a partially completed row column grid of cells partitioned into N regions each of size N cells, to be filled in using a prescribed set of N distinct symbols (typically the numbers {1, ..., N}), so that each …   Wikipedia

• Feng-hsiung Hsu — (zh cp|c=許峰雄|p=Xǔ Fēng Xióng; Cantonese: Heoi2 Fung1 Hung4) (nicknamed Crazy Bird [Computer History Museum. Mastering the Game a History of Computer Chess. February 24, 2007. [http://www.computerhistory.org/chess/viewAll.php?sec=thm 42f15cec6680f …   Wikipedia

• Feng-hsiung Hsu — (en cantonais 許峰雄 (Xǔ Fēng Xióng) est un informaticien rendu célèbre par sa participation comme architecte principal au projet d ordinateur d échecs Deep Blue, qui a vaincu le champion du monde Garry Kasparov en 1997. Sommaire 1 Carrière 2… …   Wikipédia en Français

• Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… …   Wikipedia

• Key size — In cryptography, key size or key length is the size measured in bits[1] of the key used in a cryptographic algorithm (such as a cipher). An algorithm s key length is distinct from its cryptographic security, which is a logarithmic measure of the… …   Wikipedia

• List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… …   Wikipedia

• Algorithmics of sudoku — The class of Sudoku puzzles consists of a partially completed row column grid of cells partitioned into N regions or zones each of size N cells, to be filled in using a prescribed set of N distinct symbols (typically the numbers {1, ..., N }), so …   Wikipedia

• Cryptanalysis — Close up of the rotors in a Fialka cipher machine Cryptanalysis (from the Greek kryptós, hidden , and analýein, to loosen or to untie ) is the study of methods for obtaining the meaning of encrypted information, without access to the secret… …   Wikipedia